Primitive Recursive Bounds for Van Der Waerden Numbers
نویسنده
چکیده
Presented at a meeting of the British Mathematics Colloquium; received by the editors February 10,1988. 1980 Mathematics Subject Class~fication (1985 Revision). Primary 05A99; Secondary 15A03.
منابع مشابه
A New Method to Construct Lower Bounds for Van der Waerden Numbers
We present the Cyclic Zipper Method, a procedure to construct lower bounds for Van der Waerden numbers. Using this method we improved seven lower bounds. For natural numbers r, k and n a Van der Waerden certificate W (r, k, n) is a partition of {1, . . . , n} into r subsets, such that none of them contains an arithmetic progression of length k (or larger). Van der Waerden showed that given r an...
متن کاملOn the van der Waerden numbers w(2;3,t)
On the van der Waerden numbers w(2; 3, t) Abstract In this paper we present results and conjectures on the van der Waerden numbers w(2; 3, t). We have computed the exact value of the previously unknown van der Waerden number w(2; 3, 19) = 349, and we provide new lower bounds for t = 30, we conjecture these bounds to be exact. The lower bounds for w(2; 3, t) with t = 24,. .. , 30 refute the conj...
متن کاملThe Paris-Harrington Theorem
In Ramsey theory, very large numbers and fast-growing functions are more of a rule than an exception. The classical Ramsey numbers R(n,m) are known to be of exponential size: the original proof directly gives the upper bound R(n,m) ≤ ( m+n−2 n−1 ) , and an exponential lower bound is also known. For the van der Waerden numbers, the original proof produced upper bounds that were not even primitiv...
متن کاملNew Lower Bounds for van der Waerden Numbers Using Distributed Computing
This project found improved lower bounds for van der Waerden numbers. The number W (k, r) is the length of the shortest sequence of colors with r different colors that guarantees an evenly-spaced subsequence (or arithmetic progression) of the same color of length k. We applied existing techniques: Rabung’s using primitive roots of prime numbers and Herwig et al’s Cyclic Zipper Method as improve...
متن کاملAvoiding triples in arithmetic progression ∗
Some patterns cannot be avoided ad infinitum. A well-known example of such a pattern is an arithmetic progression in partitions of natural numbers. We observed that in order to avoid arithmetic progressions, other patterns emerge. A visualization is presented that reveals these patterns. We capitalize on the observed patterns by constructing techniques to avoid arithmetic progressions. More for...
متن کامل